Almana: A BDD Minimization Tool Integrating Heuristic and Rewriting Methods
نویسندگان
چکیده
Constructing a small BDD from a given boolean formula depends on finding a good variable ordering. Finding a good order is NP-complete. In the past, methods based on heuristic analysis and formula (circuit) rewriting have shown to be useful for specific problem domains. We show that these methods need to be integrated: heuristic analysis can drive rewriting, which in turn simplifies analysis. We support this claim with experimental results, and describe Almana, an integrated tool for exploring the combination of analysis and rewriting on large boolean formulae.
منابع مشابه
Bdd Minimization by Linear Transformations
Binary Decision Diagrams (BDDs) are a powerful tool and are frequently used in many applications in VLSI CAD, like synthesis and veriication. Unfortunately, BDDs are very sensitive to the variable ordering and their size often becomes infeasible. Recently, a new approach for BDD minimization based on linear transformations, i.e. a special type of spectral techniques, has been proposed. In this ...
متن کاملInternational Workshop on Boolean Problems Freiberg , 1998 BDD Minimization by Linear
Binary Decision Diagrams (BDDs) are a powerful tool and are frequently used in many applications in VLSI CAD, like synthesis and veriication. Unfortunately, BDDs are very sensitive to the variable ordering and their size often becomes infea-sible. Recently, a new approach for BDD minimization based on linear transformations , i.e. a special type of spectral techniques, has been proposed. In thi...
متن کاملImplementation and Visualization of a BDD Package in JAVA
Decision Diagrams (DDs) are often used in VLSI CAD systems for efficient representation and manipulation of Boolean functions. The most popular data structure are reduced ordered Binary Decision Diagrams (BDDs) [Bry86,DB98], also called ROBDDs. They are part of almost all courses on function representation in VLSI CAD education. BDDs are very sensitive to the variable ordering, i.e. the size of...
متن کاملMinimization of Average Path Length in BDDs by Variable Reordering
Minimizing the Average Path Length (APL) in a BDD reduces the time needed to evaluate Boolean functions represented by BDDs. This paper describes an efficient heuristic APL minimization procedure based on BDD variable reordering. The reordering algorithm is similar to classical variable sifting with the cost function equal to the APL rather than the number of BDD nodes. The main contribution of...
متن کاملHeuristics for BDD handling of sum-of-products formulae
This paper presents the result of research on heuristic methods for assessment of fault-trees (boolean formulae) using Binary Decision Diagrams (BDDs for short). BDDs are the state-of-the-art compact representation of boolean formulae. The fault trees under consideration are given in the sum-of-products or products-of-sums form. We propose a new heuristic that is both robust and discriminating ...
متن کامل